Fairness Modulo Theory: A New Approach to LTL Software Model Checking
نویسندگان
چکیده
The construction of a proof for unsatisfiability is less costly than the construction of a ranking function. We present a new approach to LTL software model checking (i.e., to statically analyze a program and verify a temporal property from the full class of LTL including general liveness properties) which aims at exploiting this fact. The idea is to select finite prefixes of a path and check these for infeasibility before considering the full infinite path. We have implemented a tool which demonstrates the practical potential of the approach. In particular, the tool can verify several benchmark programs for a liveness property just with finite prefixes (and thus without the construction of a single ranking function).
منابع مشابه
Model Checking LTL with Fairness Assumptions using Net Unfoldings
We investigate the model checking problem for a class of petri nets using net unfoldings. Net unfoldings are a well studied partial order semantics for petri nets and are well-suited for modeling concurrent and distributed systems. We consider the problem of model checking LTL-X (LTL without the next time operator) with fairness assumptions for the class of one-safe petri nets. Recently, in [1]...
متن کاملOn Combining Partial Order Reduction with Fairness Assumptions
We present a new approach to combine partial order reduction with fairness in the context of LTL model checking. For this purpose, we define several behaviour classes representing typical fairness assumptions and examine how various reduction techniques affect these classes. In particular, we consider both reductions preserving all behaviours and reductions preserving only some behaviours.
متن کاملState/Event-Based LTL Model Checking under Parametric Generalized Fairness
In modeling a concurrent system, fairness constraints are usually considered at a specific granularity level of the system, leading to many different variants of fairness: transition fairness, object/process fairness, actor fairness, etc. These different notions of fairness can be unified by making explicit their parametrization over the relevant entities in the system as universal quantificati...
متن کاملDirect Model Checking of Temporal
In this paper, we address the problem of model checking temporal properties of nite-state programs. This problem is usually solved by modelling the program as well as the negation of the desired temporal property as automata on innnite words (B uchi automata) and checking for emptiness of the automaton resulting from the synchronous product of the program automaton and the negated property auto...
متن کاملProving More Properties with Bounded Model Checking
Bounded Model Checking, although complete in theory, has been thus far limited in practice to falsification of properties that were not invariants. In this paper we propose a termination criterion for all of LTL, and we show its effectiveness through experiments. Our approach is based on converting the LTL formula to a Büchi automaton so as to reduce model checking to the verification of a fair...
متن کامل